Scheduling time-critical instructions on RISC machines
نویسندگان
چکیده
منابع مشابه
A Fast Algorithm for Scheduling Instructions with Deadline Constraints on RISC Machines
We present a fast algorithm for scheduling UET(Unit Execution Time) instructions with deadline constraints in a basic block on RISC machines with multiple processors. Unlike Palem and Simon's algorithm, our algorithm allows latency of lij = 1 which denotes that instruction vj cannot be started before vi. The time complexity of our algorithm is O(ne+ nd), where n is the number of instructions, e...
متن کاملcient Instruction Scheduling of Real - time Programs on RISC Processors
Enabled by RISC technologies, low-cost commodity microprocessors are performing at ever increasing levels, signiicantly via instruction level parallelism (ILP). This in turn increases the opportunities for their use in a variety of day-today applications ranging from the simple control of appliances such as microwave ovens, to sophisticated systems for cabin control in modern aircraft. Indeed, ...
متن کاملApproximating Real-Time Scheduling on Identical Machines
We study the problem of assigning n tasks to m identical parallel machines in the real-time scheduling setting, where each task recurrently releases jobs that must be completed by their deadlines. The goal is to find a partition of the task set over the machines such that each job that is released by a task can meet its deadline. Since this problem is co-NP-hard, the focus is on finding α-appro...
متن کاملArchitecture for RISC Processor with CISC instructions
Microprocessor is a general purpose IC which follows the instructions given to it, and the instructions set for the microprocessor designed such a way that it can handle any type of computations [4] . Different type of architectures are available in the market like CISC, RISC, ARM SHARC etc. all of them have their own different approaches to perform computations. This Paper work which is RISC c...
متن کاملBi-objective scheduling on parallel machines with uncertain processing time
In this paper we consider bi-criteria scheduling problem on parallel machines which optimizes the number of tardy jobs with the condition of primary criterion of Tmax remains optimized. The processing times of jobs are uncertain that is not known exactly and only estimated values are given. This leads to the use of fuzzy numbers for representing these imprecise values. Here, we use triangular f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 1993
ISSN: 0164-0925,1558-4593
DOI: 10.1145/155183.155190